11 research outputs found

    Structural computations in finite permutation groups

    No full text

    Locally Recoverable Codes from Algebraic Curves and Surfaces

    No full text
    A locally recoverable code is a code over a finite alphabet such that the value of any single coordinate of a codeword can be recovered from the values of a small subset of other coordinates. Building on work of Barg, Tamo, and Vl\u{a}du\c{t}, we present several constructions of locally recoverable codes from algebraic curves and surfaces.Comment: 27 page
    corecore